On the Ball-Constrained Weighted Maximin Dispersion Problem
نویسندگان
چکیده
منابع مشابه
On the Ball-Constrained Weighted Maximin Dispersion Problem
The ball-constrained weighted maximin dispersion problem (Pball) is to find a point in an n-dimensional Euclidean ball such that the minimum of the weighted Euclidean distance from given m points is maximized. We propose a new second-order cone programming relaxation for (Pball). Under the condition m ≤ n, (Pball) is polynomial-time solvable since the new relaxation is shown to be tight. In gen...
متن کاملSubquadratic algorithms for the weighted maximin facility location problem
Let S be a set of n points in the plane, and let each point p of S have a positive weight w(p). We consider the problem of positioning a point x inside a compact region R ⊆ R such that min{ w(p)−1 · d(x, p) ; p ∈ S } is maximized. Based on the parametric search paradigm, we give the first subquadratic algorithms for this problem, with running time O(n log n). Furthermore, we shall introduce the...
متن کاملThe maximin line problem with regional demand
Given a familyP 1⁄4 fP 1; . . . ; Pmg of m polygonal regions (possibly intersecting) in the plane, we consider the problem of locating a straight line ‘ intersecting the convex hull of P and such that minkd(Pk,‘) is maximal. We give an algorithm that solves the problem in time O((m + n logm) logn) using O(m + n) space, where n is the total number of vertices of P1, . . . ,Pm. The previous best ...
متن کاملA numerical solution of the constrained weighted energy problem
A numerical algorithm is presented to solve the constrained weighted energy problem from potential theory. As one of the possible applications of this algorithm, we study the convergence properties of the rational Lanczos iteration method for the symmetric eigenvalue problem. The constrained weighted energy problem characterizes the region containing those eigenvalues that are well approximated...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2016
ISSN: 1052-6234,1095-7189
DOI: 10.1137/15m1047167